package demo;

public class MyCircularQueue {
    public int front;
    public int rear;
    public int[] elem;
    public int useSize;

    public MyCircularQueue(int k) {
        this.elem = new int[k];
    }

    public boolean enQueue(int value) {
        if (isFull()) {
            return false;
        }
        elem[rear] = value;
        rear = (rear + 1) % elem.length;
        useSize++;
        return true;
    }

    public boolean deQueue() {
        if (isEmpty()) {
            return false;
        }
        front = (front + 1) % elem.length;
        useSize--;
        return true;
    }

    public int Front() {
        if (isEmpty()) {
            return -1;
        }
        return elem[front];
    }

    public int Rear() {
        if (isEmpty()) {
            return -1;
        }
        int index = (front+useSize-1)% elem.length;
        return elem[index];
    }

    public boolean isEmpty() {
        return useSize == 0;
    }

    public boolean isFull() {
       return useSize==elem.length;
    }
}
